A Decomposition Technique For Solving Integer Programming Problems
نویسندگان
چکیده
منابع مشابه
A new approach for solving neutrosophic integer programming problems
Linear programming is one of the most important usages of operation research methods in real life, that includes of one objective function and one or several constraints which can be in the form of equality and inequality. Most of the problems in the real world are include of inconsistent and astute uncertainty, because of this reason we can’t obtain the optimal solution easily. In this paper, ...
متن کاملRESOLUTION METHOD FOR MIXED INTEGER LINEAR MULTIPLICATIVE-LINEAR BILEVEL PROBLEMS BASED ON DECOMPOSITION TECHNIQUE
In this paper, we propose an algorithm base on decomposition technique for solvingthe mixed integer linear multiplicative-linear bilevel problems. In actuality, this al-gorithm is an application of the algorithm given by G. K. Saharidis et al for casethat the rst level objective function is linear multiplicative. We use properties ofquasi-concave of bilevel programming problems and decompose th...
متن کاملA Procedure for Solving Integer Bilevel Linear Programming Problems
This paper is an extension of the K th-best approach [4] for solving bilevel linear programming problems with integer variables. NAZ cut [2] and A-T cut [3] are added to reach the integer optimum. An example is given to show the efficiency of the proposed algorithm.
متن کاملConflict graphs in solving integer programming problems
We report on the use of con ict graphs in solving integer programs A con ict graph represents logical relations between binary variables We develop algorithms and data structures that allow the e ective and e cient construction management and use of dynamically changing con ict graphs Our computational experiments show that the techniques presented work very well
متن کاملSolving Rummikub Problems by Integer Linear Programming
The Rummikub problem of finding the maximal number or value of the tiles that can be placed from your rack onto the table is very difficult, since the number of possible combinations are enormous. We show that this problem can be modeled as an integer linear programming problem. In this way solutions can be found in 1 s. We extend the model such that unnecessary changes of the existing sets on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: GANIT: Journal of Bangladesh Mathematical Society
سال: 2014
ISSN: 2224-5111,1606-3694
DOI: 10.3329/ganit.v33i0.17649